منابع مشابه
Separation of partition inequalities with terminals
Given a graph with n nodes each of them having labels equal either to 1 or 2 (a node with label 2 is called a terminal), we consider the (1,2)-survivable network design problem and more precisely, the separation problem for the partition inequalities. We show that this separation problem reduces to a sequence of submodular flow problems. Based on an algorithm developed by Fujishige and Zhang th...
متن کاملRefinements of Some Partition Inequalities
In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if M 5 is an integer and the integers a and b are relatively prime to M and satisfy 1 a < b < M/2, and the c(m,n) are defined by 1 (sqa, sqM a; qM )1 1 (sqb, sqM b; qM )1 := X
متن کاملPartition Regular Systems of Linear Inequalities
3 (m,p,c)-sets 59 4 Canonical Results 63 5 Coloring Objects of Higher Rank 65 1 Introduction In 1930 Ramsey published his paper On a problem in formal logic 12]. He established a result, nowadays known as Ramsey's Theorem: Let k and r be positive integers. Then for every r-coloring of the k-element subsets of ! there exists an innnite subset S ! such that all k-element subsets of S are colored ...
متن کاملPartition chromatographic separation of adenine and guanine.
In the course of an investigation into the metabolic pathways of nucleotide purines by means of tracer elements, it became necessary to prepare from biological sources pure specimens of adenine and guanine in sticient quantities for analyses in the mass spectrometer. In general, for preparative purposes, use has been made of the insolubility of adenine and guanine under certain strictly specifi...
متن کاملBonferroni-Galambos Inequalities for Partition Lattices
In this paper, we establish a new analogue of the classical Bonferroni inequalities and their improvements by Galambos for sums of type ∑ π∈P(U)(−1)(|π| − 1)!f(π) where U is a finite set, P(U) is the partition lattice of U and f : P(U) → R is some suitable non-negative function. Applications of this new analogue are given to counting connected k-uniform hypergraphs, network reliability, and cum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2000
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.25.2.243.12223